HashMap concurrent insert/std::collections::HashMap (single-threaded)
|
|
Additional Statistics:
| Lower bound | Estimate | Upper bound | |
|---|---|---|---|
| Slope | 1.8850 ms | 1.8894 ms | 1.8938 ms |
| R² | 0.9879188 | 0.9886571 | 0.9879146 |
| Mean | 1.8868 ms | 1.8902 ms | 1.8936 ms |
| Std. Dev. | 14.878 µs | 17.403 µs | 19.672 µs |
| Median | 1.8887 ms | 1.8907 ms | 1.8935 ms |
| MAD | 9.5612 µs | 13.829 µs | 21.389 µs |
Understanding this report:
The plot on the left displays the average time per iteration for this benchmark. The shaded region shows the estimated probability of an iteration taking a certain amount of time, while the line shows the mean. Click on the plot for a larger view showing the outliers.
The plot on the right shows the linear regression calculated from the measurements. Each point represents a sample, though here it shows the total time for the sample rather than time per iteration. The line is the line of best fit for these measurements.
See the documentation for more details on the additional statistics.